PERSISTENTLY LAMINAR TANGLES
نویسندگان
چکیده
منابع مشابه
Persistently Laminar Tangles
We show how to build tangles T in a 3-ball with the property that any knot obtained by tangle sum with T has a persistent lamination in its exterior, and therefore has property P. The construction is based on an example of a persistent lamination in the exterior of the twist knot 61, due to Ulrich Oertel. We also show how the construction can be generalized to n-string tangles.
متن کاملPersistently laminar branched surfaces
We define sink marks for branched complexes and find conditions for them to determine a branched surface structure. These will be used to construct branched surfaces in knot and tangle complements. We will extend Delman’s theorem and prove that a non 2-bridge Montesinos knot K has a persistently laminar branched surface unless it is equivalent to K(1/2q1, 1/q2, 1/q3, −1) for some positive integ...
متن کاملTangled Tangles
The Tangle toy [Zaw15, Zaw85] is a topological manipulation toy that can be twisted and turned in a variety of different ways, producing different geometric configurations. Some of these configurations lie in 3D space while others may be flattened into planar shapes. The toy consists of several curved, quarter-circle pieces fit together at rotational/twist joints. Each quarter-circle piece can ...
متن کاملKnots, Links and Tangles
We start with some terminology from differential topology [1]. Let be a circle and ≥ 2 be an integer. An immersion : → R is a smooth function whose derivative never vanishes. An embedding : → R is an immersion that is oneto-one. It follows that () is a manifold but () need not be ( is only locally one-to-one, so consider the map that twists into a figure eight). A knot is a s...
متن کاملComputing with Colored Tangles
We suggest a diagrammatic model of computation based on an axiom of distributivity. A diagram of a decorated colored tangle, similar to those that appear in low dimensional topology, plays the role of a circuit diagram. Equivalent diagrams represent bisimilar computations. We prove that our model of computation is Turing complete and with bounded resources that it can decide any language in com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Knot Theory and Its Ramifications
سال: 1999
ISSN: 0218-2165,1793-6527
DOI: 10.1142/s0218216599000286